Symmetries of the Stable Kneser Graphs

نویسنده

  • BENJAMIN BRAUN
چکیده

It is well known that the automorphism group of the Kneser graph KGn,k is the symmetric group on n letters. For n ≥ 2k + 1, k ≥ 2, we prove that the automorphism group of the stable Kneser graph SGn,k is the dihedral group of order 2n. Let [n] := [1, 2, 3, . . . , n]. For each n ≥ 2k, n, k ∈ {1, 2, 3, . . .}, the Kneser graph KGn,k has as vertices the k-subsets of [n] with edges defined by disjoint pairs of k-subsets. For the same parameters, the stable Kneser graph SGn,k is the subgraph of KGn,k induced by the stable ksubsets of [n], i.e. those subsets that do not contain any 2-subset of the form {i, i + 1} or {1, n}. The Kneser and stable Kneser graphs are important graphs in algebraic and topological combinatorics. L. Lovász proved in [3] via an ingenious use of the Borsuk-Ulam theorem that χ(KGn,k) = n− 2k + 2, verifying a conjecture due to M. Kneser. Shortly afterwards, A. Schrijver proved in [5], again using the BorsukUlam theorem, that χ(SGn,k) = n− 2k+ 2. Schrijver also proved that the stable Kneser graphs are vertex critical, i.e. the chromatic number of any proper subgraph of SGn,k is strictly less than n − 2k + 2; for this reason, the stable Kneser graphs are also known as the Schrijver graphs. These results sparked a series of dramatic applications of algebraic topology in combinatorics that continues to this day. Despite these general advances, there are many unanswered questions regarding Kneser and stable Kneser graphs. For example, it is well known that for n ≥ 2k+ 1 the automorphism group of the Kneser graph KGn,k is the symmetric group on n letters, with the action induced by the permutation action on [n]; see [2] for a textbook account. The proof of this relies on the Erdős-Ko-Rado theorem characterizing maximal independent sets in KGn,k, where an independent set in a graph is a collection of pairwise non-adjacent vertices. However, the automorphism groups of the stable Kneser graphs are not determined; Date: September 16, 2008. 2000 Mathematics Subject Classification. Primary 05C99, 05E99.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Shifts of the stable Kneser graphs and hom-idempotence

A graph G is said to be hom-idempotent if there is a homomorphism from G2 to G, and weakly hom-idempotent if for some n ≥ 1 there is a homomorphism from Gn+1 to Gn. Larose et al. (1998) proved that Kneser graphs KG(n, k) are not weakly hom-idempotent for n ≥ 2k + 1, k ≥ 2. For s ≥ 2, we characterize all the shifts (i.e., automorphisms of the graph that map every vertex to one of its neighbors) ...

متن کامل

Stable sets of maximal size in Kneser-type graphs

We introduce a family of vertex-transitive graphs with specified subgroups of automorphisms which generalise Kneser graphs, powers of complete graphs and Cayley graphs of permutations. We compute the stability ratio for a wide class of these. Under certain conditions we characterise their stable sets of maximal size. © 2003 Elsevier Ltd. All rights reserved. MSC (2000): 05D05; 05C99

متن کامل

Independence Complexes of Stable Kneser Graphs

For integers n ≥ 1, k ≥ 0, the stable Kneser graph SGn,k (also called the Schrijver graph) has as vertex set the stable n-subsets of [2n + k] and as edges disjoint pairs of n-subsets, where a stable n-subset is one that does not contain any 2-subset of the form {i, i + 1} or {1, 2n + k}. The stable Kneser graphs have been an interesting object of study since the late 1970’s when A. Schrijver de...

متن کامل

The chromatic number of almost stable Kneser hypergraphs

Let V (n, k, s) be the set of k-subsets S of [n] such that for all i, j ∈ S, we have |i−j| ≥ s We define almost s-stable Kneser hypergraph KG ( [n] k )∼ s-stab to be the r-uniform hypergraph whose vertex set is V (n, k, s) and whose edges are the r-uples of disjoint elements of V (n, k, s). With the help of a Zp-Tucker lemma, we prove that, for p prime and for any n ≥ kp, the chromatic number o...

متن کامل

Local chromatic number and the Borsuk-Ulam Theorem

The local chromatic number of a graph was introduced in [13]. It is in between the chromatic and fractional chromatic numbers. This motivates the study of the local chromatic number of graphs for which these quantities are far apart. Such graphs include Kneser graphs, their vertex color-critical subgraphs, the stable Kneser (or Schrijver) graphs; Mycielski graphs, and their generalizations; and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008